Computational complexity of determining resource loops in re-entrant flow lines

نویسندگان

  • Frank L. Lewis
  • Bill G. Horne
  • Chaouki T. Abdallah
چکیده

Fig. 9. The searching tree after inputting the same task command for the second time (with the initial state the same as in the first time). The desired node picked up by the explanation-based learning engine is node 28 and the generated searching template is supe-rior_order([next_to(_, _), on(_, _)]). When the same task command was inputted for the second time (with the initial state the same as in the first time), the planned action sequence is the same as in the first time, yet the corresponding searching tree alters, as shown in Fig. 9, where nodes 1–4 and 25 simply corre-however, the explanation-based learning engine fails to generate any other new searching template, because no desired node on the corresponding searching tree can be found, though there does be a successful leaf node. It can be seen that the number of the nodes searched in the second time decreases almost a half than in the first time and no backtracking happens. The searching efficiency is greatly increased. The effect of explanation-based learning is significant. V. SUMMARY The main contributions of this paper are as follows: 1) Explanation-based learning has been accurately placed in the triangle of problem solving, i.e., with the angle of searching mechanism. 2) A problem formulation has been made for robot action planning (RAP), which gives in-depth comprehensibility of RAP, especially that of means-ends analysis searching mechanism. 3) A new learning-based method has been developed for RAP, i.e., robot action planning via explanation-based learning (RAPEL), which is aiming at computer-realized recognition and acquisition of domain-specific searching heuristics. 4) The overall scheme of RAPEL has been put forward and the principle of RAPEL has been established, and terms, notations, grammars and paradigms of Prolog language are directly employed for the purpose of strictness. 5) Configuration of node has been proposed, by which node growth can be visually illustrated. 6) Logic chart has been proposed, by which processes of synthesizing action sequences can be visually illustrated. REFERENCES [1] R. E. Fikes and N. J. Nilsson, " STRIPS: A new approach to the application of theorem proving to problem solving, " Artif. Fuzzy logic-based formulation of the organization of intelligent robotic systems, " An efficient planning technique for robotic assemblies and intelligent robotic systems, " J. Intell. Robot. Abstract—This paper presents a comparison study of the computational complexity of the general job shop protocol and the more structured flow line …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II

In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...

متن کامل

A Multi-Level GA Search with Application to the Resource-Constrained Re-Entrant Flow Shop Scheduling Problem

Re-entrant scheduling is an important search problem with many constraints in the flow shop. In the literature, a number of approaches have been investigated from exact methods to meta-heuristics. This paper presents a genetic algorithm that encodes the problem as multi-level chromosomes to reflect the dependent relationship of the re-entrant possibility and resource consumption. The novel enco...

متن کامل

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

متن کامل

Modeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time

This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production s...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Traffic flow models and service rules for complex production systems

We present an overview over recent developments of traffic flow models for production networks. Particular emphasis is given to the implementation of service rules for complex systems, involving multiple product types and re entrant loops. A rather general scheduling concept is introduced and demonstrated on some numerical experiments.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Systems, Man, and Cybernetics, Part A

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2000